Efficient Answer Enumeration in Description Logics with Functional Roles
نویسندگان
چکیده
We study the enumeration of answers to ontology-mediated queries when ontology is formulated in a description logic that supports functional roles and query CQ. In particular, we show possible with linear preprocessing constant delay certain extension CQ (pertaining roles) acyclic free-connex acyclic. This holds both for complete partial answers. provide matching lower bounds case where self-join free.
منابع مشابه
Towards Efficient Reasoning for Description Logics with Inverse Roles
This paper presents a first proposal for improving the efficiency of modern description logic (DL) reasoners that are known to be less efficient for DLs with inverse roles. The current loss of performance is usually caused by the missing applicability of well-known optimization techniques such as caching the satisfiability status of modal successors. In order to improve this situation we propos...
متن کاملDescription Logics with Inverse Roles , Functional Restrictions , and N - ary
Description Logics (DLs) are used in Artiicial Intelligence to represent knowledge in terms of objects grouped into classes, and ooer structuring mechanisms for both characterizing the relevant properties of classes in terms of binary relations, and establishing several interde-pendencies among classes. One of the main themes in the area of DLs has been to identify DLs that are both very expres...
متن کاملDescription Logics with Transitive Roles
This paper describes the logic ALCHR+ , which extends ALCR+ with a primitive role hierarchy, and presents an appropriate extension to the ALCR+ satisfiability testing algorithm. ALCHR+ is of interest because it provides useful additional expressive power and, although its satisfiability problem is Exptimecomplete, the algorithm is relatively simple and is amenable to optimisation.
متن کاملEuclidian Roles in Description Logics
In the current paper we investigate the role of Euclidian roles in Description Logics.
متن کاملIntegrating Description Logics and Answer Set Programming
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i5.25797